New 4(3) Pairs Diagonally Implicit Runge-Kutta-Nyström Method for Periodic IVPs
نویسندگان
چکیده
منابع مشابه
A New Diagonally Implicit Runge-Kutta-Nyström Method for Periodic IVPs
A new diagonally implicit Runge-Kutta-Nyström (RKN) method is developed for the integration of initial-value problems for second-order ordinary differential equations possessing oscillatory solutions. Presented is a method which is three-stage fourth-order with dispersive order six and 'small' principal local truncation error terms and dissipation constant. The analysis of phase-lag, dissipatio...
متن کاملEmbedded diagonally implicit Runge-Kutta-Nystrom 4(3) pair for solving special second-order IVPs
Abstract In this paper, third-order 3-stage diagonally implicit Runge–Kutta–Nystrom method embedded in fourthorder 4-stage for solving special second-order initial value problems is constructed. The method has the property of minimized local truncation error as well as the last row of the coefficient matrix is equal to the vector output. The stability of the method is investigated and a standar...
متن کاملDiagonally implicit Runge-Kutta methods for 3D shallow water applications
We construct A-stable and L-stable diagonally implicit Runge-Kutta methods of which the diagonal vector in the Butcher matrix has a minimal maximum norm. If the implicit Runge-Kutta relations are iteratively solved by means of the approximately factorized Newton process, then such iterated Runge-Kutta methods are suitable methods for integrating shallow water problems in the sense that the stab...
متن کاملDiagonally Implicit Symplectic Runge-Kutta Methods with Special Properties
The numerical integration of Hamiltonian systems is considered in this paper. Diagonally implicit Symplectic Runge-Kutta methods with special properties are presented. The methods developed have six and seven stages algebraic order up to 5th and dispersion order up to 8th.
متن کاملEmbedded Diagonally Implicit Runge - Kutta Algorithms on Parallel Computers
This paper investigates diagonally implicit Runge-Kutta methods in which the implicit relations can be solved in parallel and are singly diagonalimplicit on each processor. The algorithms are based on diagonally implicit iteration of fully implicit Runge-Kutta methods of high order. The iteration scheme is chosen in such a way that the resulting algorithm is ^(a)-stable or Z,(a)-stable with a e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Dynamics in Nature and Society
سال: 2012
ISSN: 1026-0226,1607-887X
DOI: 10.1155/2012/324989